Computing the Algebraic Immunity Efficiently
نویسندگان
چکیده
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very efficient if this system is of low degree. In particular, they have been used to break stream ciphers immune to all previously known attacks. This kind of attack tends to work when certain Boolean functions used in the ciphering process have either low degree annihilators or low degree multiples. It is therefore important to be able to check this criterion for Boolean functions. We provide in this article an algorithm of complexity O `
منابع مشابه
Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean fu...
متن کاملOn the (Fast) Algebraic Immunity of Boolean Power Functions
The (fast) algebraic immunity, including (standard) algebraic immunity and the resistance against fast algebraic attacks, has been considered as an important cryptographic property for Boolean functions used in stream ciphers. This paper is on the determination of the (fast) algebraic immunity of a special class of Boolean functions, called Boolean power functions. An n-variable Boolean power f...
متن کاملOn the Algebraic Immunity of Symmetric Boolean Functions
In this paper, we analyse the algebraic immunity of symmetric Boolean functions. We identify a set of lowest degree annihilators for symmetric functions and propose an efficient algorithm for computing the algebraic immunity of a symmetric function. The existence of several symmetric functions with maximum algebraic immunity is proven. In this way, a new class of function which have good implem...
متن کاملUsing Wiedemann's Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
We show in this paper how to apply well known methods from sparse linear algebra to the problem of computing the immunity of a Boolean function against algebraic or fast algebraic attacks. For an n-variable Boolean function, this approach gives an algorithm that works for both attacks in O(n2D) complexity and O(n2) memory. Here D = `
متن کاملEfficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in O(D) operations, for D ≈ ` n d ́ , rather than in O(D) operations necessary in all p...
متن کامل